Topological Properties and Broadcasting Algorithm of Hyper-Star Interconnection Network
نویسندگان
چکیده
منابع مشابه
Broadcasting Algorithms for the Star-Connected Cycles Interconnection Network
| The star-connected cycles (SCC) graph was recently proposed as an alternative to the cube-connected cycles (CCC) graph, using a star graph to connect cycles of nodes rather than a hypercube. This paper presents an analysis of broadcasting algorithms for SIMD and MIMD SCCs, covering both one-port and multiple-port versions. We show that O(n log n) one-port broadcasting algorithms that have bee...
متن کاملTopological Properties and Broadcasting Algorithms of the Generalized-Star Cube
In this research, another version of the star cube called the generalized-star cube, GSC(n, k,m), is presented as a three level interconnection topology. GSC(n, k,m) is a product graph of the (n, k)-star graph and the m-dimensional hypercube (m-cube). It can be constructed in one of two ways: to replace each node in an m-cube with an (n, k)-star graph, or to replace each node in an (n, k)-star ...
متن کاملTopological Properties of Some Interconnection Network Graphs
Interconnection networks play a vital role in parallel computing architectures. We investigate topological properties of some networks proposed for parallel computation, based on their underlying graph models. The vertices of the graph correspond to processors and the edges represent communication links between processors. Parameters such as crossing number and thickness strongly aaect the area...
متن کاملA Comparative Study on the Topological Properties of the Hyper-Mesh Interconnection Network
Recent ad*vances in parallel computing and the increasing need for massive parallelism resulted in the emergence of many attractive interconnection networks. Hypercube and mesh topologies have drawn considerable attention due to many of their attractive properties that are suited for parallel computing. However, both has certain major drawbacks that are affecting their over all performance. Thi...
متن کاملNeighbourhood Broadcasting Scheme for Star Interconnection Networks
This paper proposes a new Neighbourhood broadcasting scheme in the Star Interconnection Networks which takes at most 1.33 log2(n− 1) + O(1) time steps. The scheme is better than of [3] which takes at most 1.5 log2(n− 2) + O(1) time steps. With the same number of steps, the paper also proposes another Neighbourhood broadcasting scheme which performs better than that of [3]. The proposed scheme w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The KIPS Transactions:PartA
سال: 2004
ISSN: 1598-2831
DOI: 10.3745/kipsta.2004.11a.5.341